Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
نویسندگان
چکیده
منابع مشابه
On Odd-graceful Labeling of Disjoint Union of Graphs
Let G = (V, E) be a finite, simple and undirected graph having v = |V (G)| and e = |E(G)|. A graph G with q edges is said to be odd-graceful if there is an injection f : V (G) → {0, 1, 2, . . . , 2q−1} such that, when each edge xy is assigned the label |f(x)−f(y)|, the resulting edge labels are {1, 3, 5, . . . , 2q−1}. Motivated by the work of Z. Gao [6], we have defined odd graceful labeling f...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملEdge irregular total labeling of certain family of graphs
An edge irregular total k-labeling φ : V (G)∪E(G) → {1, 2, . . . , k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges xy and x′y′ their weights φ(x) + φ(xy) + φ(y) and φ(x′) + φ(x′y′) + φ(y′) are distinct. The total edge irregularity strength, tes(G), is defined as the minimum k for which G has an edge irregular total k-labeling. We have ...
متن کاملIrregular total labeling of disjoint union of prisms and cycles
We investigate two modifications of the well-known irregularity strength of graphs, namely, a total edge irregularity strength and a total vertex irregularity strength. Recently the bounds and precise values for some families of graphs concerning these parameters have been determined. In this paper, we determine the exact value of the total edge (vertex) irregularity strength for the disjoint u...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2018
ISSN: 2227-7390
DOI: 10.3390/math6090142